On LCD, self dual and isodual cyclic codes over finite chain rings
نویسندگان
چکیده
In this paper, LCD cyclic, self dual and isodual codes over finite chain rings are investigated. It was proven recently that a non-free cyclic code does not exist rings. Based on algebraic number theory, we introduce necessary sufficient conditions for which all free ring LCD. We have also obtained the existence of non trivial any length when nilpotency index maximal ideal is even. Further, several constructions given based factorization polynomial xn−1 ring.
منابع مشابه
On self-dual cyclic codes over finite chain rings
Let R be a finite commutative chain ring with unique maximal ideal 〈γ〉, and let n be a positive integer coprime with the characteristic of R/〈γ〉. In this paper, the algebraic structure of cyclic codes of length n over R is investigated. Some new necessary and sufficient conditions for the existence of nontrivial self-dual cyclic codes are provided. An enumeration formula for the self-dual cycli...
متن کاملOn Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given.
متن کاملQuasi-Cyclic Codes Over Finite Chain Rings
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...
متن کاملConstructions of self-dual codes over finite commutative chain rings
We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the...
متن کاملDouble circulant self-dual and LCD codes over Galois rings
This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic p and order p with p and odd prime. When p ≡ 3 (mod 4), we give an algorithm to construct a duality preserving bijective Gray map from such a Galois ring to Z p2 . Using random coding, we obtain families of asymptotically good self-dual an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2022.101993